A context-free language decision problem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decision problem of substrings in Context Free Languages

A context free grammar (CFG) is a set of symbols and productions used to define a context free language. We present an algorithm which, given a CFG and a string α, decides whether a string of the form βαγ belongs to the language or not. There is a wide variety of applications where deciding if a string belongs to the defined language has relevance but, due to “visualization” limitations, it is ...

متن کامل

Context-Free Language Theory Formalization

Proof assistants are software-based tools that are used in the mechanization of proof construction and validation in mathematics and computer science, and also in certified program development. Different tools are being increasingly used in order to accelerate and simplify proof checking. Context-free language theory is a well-established area of mathematics, relevant to computer science founda...

متن کامل

Evolving context-free language predictors

Recurrent neural networks can represent and process simple context-free languages. However, the diiculty of nding with gradient-based learning appropriate weights for context-free language prediction motivates an investigation on the applicability of evolutionary algorithms. By empirical studies , an evolutionary algorithm proves to be more reliable in nding prediction solutions to a simple CFL...

متن کامل

The Word Problem of $\mathbb{Z}^n$ Is a Multiple Context-Free Language

The word problem of a group G = Σ can be defined as the set of formal words in Σ * that represent the identity in G. When viewed as formal languages, this gives a strong connection between classes of groups and classes of formal languages. For example, Anisimov [An¯ ı71] showed that a group is finite if and only if its word problem is a regular language, and Muller and Schupp [MS83] showed that...

متن کامل

The Set of Minimal Words of a Context-Free Language is Context-Free

Let A be a finite, totally ordered alphabet, and let P be the lexicographic ordering on A*. Let X be a subset of A*. The language of minimal words of X is the subset of X composed of the lexicographically minimal word of X for each length: Min(X)=[x # X | \w # X, |w|=|x| O xPw]. The aim of this paper is to prove that if L is a context-free language, then the language Min(L) context-free. ] 1997

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1994

ISSN: 0304-3975

DOI: 10.1016/0304-3975(94)90256-9